1,565 research outputs found

    Growth and Election Outcomes in a Developing Country.

    Get PDF
    With the exception Brander and Drazen (2008), who use a comprehensive cross-country database consisting of both developed and developing countries, the hypothesis that rapid growth helps incumbents win elections has been tested exclusively for the developed countries (e.g., Ray Fair 1978). But since sustained rapid growth offers the prospect of pulling vast numbers of the voters out of poverty within a generation, such an effect is far more likely to be present in the developing rather than developed countries. In this paper, we offer the first test of the hypothesis on a large developing and poor country, India, which has seen its economy grow 8 to 9 percent recently. We first generalize the Fair model to allow for multiple candidates instead for just two and then test it using crossstate data. We find quantitatively large and statistically robust effect of growth on the prospects of the candidates of the state incumbent parties to win elections. Specifically, we use the data on 422 candidates in the 2009 parliamentary elections and show that the candidates of incumbent parties in high-growth states have much better prospects of victory than those in low-growth states.

    Free Trade Areas and Rules of Origin: Economics and Politics

    Get PDF
    We incorporate intermediate inputs into a small-union general- equilibrium model and develop the welfare economics of preferential trading under the rules of origin. Combining this analysis with the Grossman-Helpman political-economy model, we demonstrate that the rules of origin can improve the political viability of FTAs. Two interesting outcomes are derived. First, an FTA that lowered joint welfare of the union and was voted down in the absence of the rules of origin may become feasible in the presence of these rules. Second, an FTA that increased joint welfare of the union but was voted down in the absence of the rules of origin may become acceptable in the presence of these rules but it may also turn welfare inferior to status quo.

    Did the Multi-fiber Agreement Make the NAFTA Politically More Acceptable? A Theoretical Analysis.

    Get PDF
    The central question addressed in this paper is whether the presence of the MFA made the NAFTA politically more acceptable. Assuming that the government maximizes a weighted sum of welfare and producer profits, we derive four key results. First, taking the initial level of trade restriction as exogenously given, it is possible for an FTA to be endorsed by both parties under the MFA-like quota in one country though it is unambiguously rejected under a tariff that provides equal protection. Second, if the initial MFA quota is itself chosen endogenously, as long as all quota rents accrue to exporting countries, the quota is set so as to yield either autarky or free trade. Third, an intermediate outcome can obtain if quota rents are shared between the trading partners as is true, for example, under a tariff quota. Depending on the degree of the government’s bias in favor of producers, this outcome may be more or less restrictive than that obtained under a tariff. Finally, assuming parameter values that give rise to the intermediate outcome initially, it remains possible for an FTA to be endorsed under the MFA-type quota when it is turned down by one of the potential partners under a tariff. But it is now also possible for the opposite to happen: an FTA that is endorsed under a tariff may be turned down under the MFA-type quota.

    Some Fixed Point and Common Fixed Point Results in L – Space

    Get PDF
    There are several theorems are prove in L – space, using various type of mappings. In this paper, we prove some fixed point theorem and common fixed point theorem in L- space using different, symmetric rational mappings. Keywords: Fixed point, Common Fixed point, L – space, Continuous mapping, Self Mapping, Weakly Compatible Mappings

    Fixed Point Theorem in Intuitionistic Fuzzy Metric Space by Using Occasionally Weakly Compatible Maps in Rational Form

    Get PDF
    In this paper we have generalized the result of Kamal Wadhwa and Hariom Dubey by using occasionally weakly compatible maps using intuitionistic fuzzy metric space. The concept of compatible maps introduced by Kramosil and Michalek and weakly compatible maps in fuzzy metric space is generalized by A. Al. Thagafi and Nasser Shahzad by introducing the concept of occasionally weakly compatible mappings. Keywords: Fixed point, intuitionistic fuzzy metric space, compatible mappings

    Minimum Cost Homomorphisms to Reflexive Digraphs

    Full text link
    For digraphs GG and HH, a homomorphism of GG to HH is a mapping $f:\ V(G)\dom V(H)suchthat such that uv\in A(G)implies implies f(u)f(v)\in A(H).Ifmoreovereachvertex. If moreover each vertex u \in V(G)isassociatedwithcosts is associated with costs c_i(u), i \in V(H),thenthecostofahomomorphism, then the cost of a homomorphism fis is \sum_{u\in V(G)}c_{f(u)}(u).Foreachfixeddigraph. For each fixed digraph H, the {\em minimum cost homomorphism problem} for H,denotedMinHOM(, denoted MinHOM(H),isthefollowingproblem.Givenaninputdigraph), is the following problem. Given an input digraph G,togetherwithcosts, together with costs c_i(u),, u\in V(G),, i\in V(H),andaninteger, and an integer k,decideif, decide if Gadmitsahomomorphismto admits a homomorphism to Hofcostnotexceeding of cost not exceeding k. We focus on the minimum cost homomorphism problem for {\em reflexive} digraphs H(everyvertexof (every vertex of Hhasaloop).ItisknownthattheproblemMinHOM( has a loop). It is known that the problem MinHOM(H)ispolynomialtimesolvableifthedigraph) is polynomial time solvable if the digraph H has a {\em Min-Max ordering}, i.e., if its vertices can be linearly ordered by <sothat so that i<j, s<rand and ir, js \in A(H)implythat imply that is \in A(H)and and jr \in A(H).WegiveaforbiddeninducedsubgraphcharacterizationofreflexivedigraphswithaMin−Maxordering;ourcharacterizationimpliesapolynomialtimetestfortheexistenceofaMin−Maxordering.Usingthischaracterization,weshowthatforareflexivedigraph. We give a forbidden induced subgraph characterization of reflexive digraphs with a Min-Max ordering; our characterization implies a polynomial time test for the existence of a Min-Max ordering. Using this characterization, we show that for a reflexive digraph H$ which does not admit a Min-Max ordering, the minimum cost homomorphism problem is NP-complete. Thus we obtain a full dichotomy classification of the complexity of minimum cost homomorphism problems for reflexive digraphs
    • 

    corecore